package com.xiu.travel.util;

import java.util.Set;
import java.util.TreeSet;

/**
 * 生成雪花id工具类
 *
 * @author yingyingying
 * @date 2023/3/14 19:42
 */
public class SnowFlakeUtil
{

    // ==============================Fields===========================================
    /**
     * 开始时间截 (2020-07-15)
     */
    private final long twepoch = 1679556277376L;
    /**
     * 机器id所占的位数
     */
    private final long workerIdBits = 5L;

    /**
     * 数据标识id所占的位数
     */
    private final long datacenterIdBits = 5L;

    /**
     * 序列在id中占的位数
     */
    private final long sequenceBits = 12L;

    /**
     * 机器ID向左移12位
     */
    private final long workerIdShift = sequenceBits;

    /**
     * 数据标识id向左移17位(12+5)
     */
    private final long datacenterIdShift = sequenceBits + workerIdBits;

    /**
     * 时间截向左移22位(5+5+12)
     */
    private final long timestampLeftShift = sequenceBits + workerIdBits + datacenterIdBits;

    /**
     * 工作机器ID(0~31)
     */
    private final long workerId;

    /**
     * 数据中心ID(0~31)
     */
    private final long datacenterId;

    /**
     * 毫秒内序列(0~4095)
     */
    private long sequence = 0L;

    /**
     * 上次生成ID的时间截
     */
    private long lastTimestamp = -1L;

    //==============================Constructors=====================================

    /**
     * 构造函数
     *
     * @param workerId     工作ID (0~31)
     * @param datacenterId 数据中心ID (0~31)
     */
    public SnowFlakeUtil(long workerId, long datacenterId)
    {
        /*
          支持的最大机器id，结果是31 (这个移位算法可以很快的计算出几位二进制数所能表示的最大十进制数)
         */
        long maxWorkerId = ~(-1L << workerIdBits);
        if ( workerId > maxWorkerId || workerId < 0 )
        {
            throw new IllegalArgumentException(String.format("worker Id can't be greater than %d or less than 0",
                                                             maxWorkerId));
        }
        /*
          支持的最大数据标识id，结果是31
         */
        long maxDatacenterId = ~(-1L << datacenterIdBits);
        if ( datacenterId > maxDatacenterId || datacenterId < 0 )
        {
            throw new IllegalArgumentException(String.format("datacenter Id can't be greater than %d or less than 0",
                                                             maxDatacenterId));
        }
        this.workerId = workerId;
        this.datacenterId = datacenterId;
    }

    // ==============================Methods==========================================

    /**
     * 获得下一个ID (string)
     **/
    public synchronized String generateNextId()
    {
        long timestamp = nextId();
        //移位并通过或运算拼到一起组成64位的ID
        return String.valueOf(((timestamp - twepoch) << timestampLeftShift)
                                      | (datacenterId << datacenterIdShift)
                                      | (workerId << workerIdShift)
                                      | sequence);
    }

    /**
     * 获得下一个ID (该方法是线程安全的)
     *
     * @return SnowflakeId
     */
    public synchronized long nextId()
    {
        long timestamp = timeGen();

        //如果当前时间小于上一次ID生成的时间戳，说明系统时钟回退过这个时候应当抛出异常
        if ( timestamp < lastTimestamp )
        {
            throw new RuntimeException(
                    String.format("Clock moved backwards.  Refusing to generate id for %d milliseconds",
                                  lastTimestamp - timestamp));
        }

        //如果是同一时间生成的，则进行毫秒内序列
        if ( lastTimestamp == timestamp )
        {
            /*
              生成序列的掩码，这里为4095 (0b111111111111=0xfff=4095)
             */
            long sequenceMask = ~(-1L << sequenceBits);
            sequence = (sequence + 1) & sequenceMask;
            //毫秒内序列溢出
            if ( sequence == 0 )
            {
                //阻塞到下一个毫秒,获得新的时间戳
                timestamp = tilNextMillis(lastTimestamp);
            }
        }
        //时间戳改变，毫秒内序列重置
        else
        {
            sequence = 0L;
        }

        //上次生成ID的时间截
        lastTimestamp = timestamp;

        //移位并通过或运算拼到一起组成64位的ID
        return ((timestamp - twepoch) << timestampLeftShift)
                | (datacenterId << datacenterIdShift)
                | (workerId << workerIdShift)
                | sequence;
    }

    /**
     * 阻塞到下一个毫秒，直到获得新的时间戳
     *
     * @param lastTimestamp 上次生成ID的时间截
     * @return 当前时间戳
     */
    protected long tilNextMillis(long lastTimestamp)
    {
        long timestamp = timeGen();
        while (timestamp <= lastTimestamp)
        {
            timestamp = timeGen();
        }
        return timestamp;
    }

    /**
     * 返回以毫秒为单位的当前时间
     *
     * @return 当前时间(毫秒)
     */
    protected long timeGen()
    {
        return System.currentTimeMillis();
    }


    /**
     * 单次获取雪花id
     */
    public static long getSnowflakeId()
    {
        SnowFlakeUtil snowFlakeUtil = new SnowFlakeUtil(1, 1);
        return snowFlakeUtil.nextId();
    }

    public static class Test
    {
        public static void main(String[] args)
        {
            {
                long count = 10000000L;
                SnowFlakeUtil snowFlakeGenerateIdWorker =
                        new SnowFlakeUtil(0L, 0L);
                //String类型id
                String s = snowFlakeGenerateIdWorker.generateNextId();
                System.out.println(s);
                //long类型id
                long l = snowFlakeGenerateIdWorker.nextId();
                System.out.println(l);
                // 验证生成1000万个id需要多久
                long startTime = System.currentTimeMillis();
                // 生成1000万个id,塞入set,测试是否有重复id
                Set<Long> set = new TreeSet<>();
                for ( int i = 0; i < count; i++ )
                {
                    set.add(snowFlakeGenerateIdWorker.nextId());
                }
                System.out.println(set.size());
                System.out.println("耗时" + (System.currentTimeMillis() - startTime) + "毫秒");
            }
        }
    }
}
